Competitive solutions for online financial problems
نویسندگان
چکیده
منابع مشابه
Online Financial Algorithms Competitive Analysis
Analysis of algorithms with complete knowledge of its inputs is sometimes not up to our expectations. Many times we are surrounded with such scenarios where inputs are generated without any prior knowledge. Online Algorithms have found their applicability in broad areas of computer engineering. Among these, an online financial algorithm is one of the most important areas where lots of efforts h...
متن کاملTackling Financial Problems Can Require Non-Financial Solutions
Financial regulation is most effective when it targets the origins of the problem it seeks to remedy. This is akin to the medical adage: treat the cause, not the symptom. Identifying the causal factors driving distress in financial markets is no easy task. One complication is that the cause might lie in non-financial markets. New research on the financial crisis highlights this point. Attempts ...
متن کاملAn O(logn)-Competitive Algorithm for Online Constrained Forest Problems
In the generalized Steiner tree problem, we find a minimumcost set of edges to connect a given set of source-sink pairs. In the online version of this problem, the source-sink pairs arrive over time. Agrawal, Klein, and Ravi [1] give a 2-approximation algorithm for the offline problem; Berman and Coulston [3] give an O(logn)-competitive algorithm for the online problem. Goemans and Williamson [...
متن کاملCompetitive newsvendor problems with the same Nash and Stackelberg solutions
Consider two newsvendors: (i) they compete satisfying substitutable demands searching Nash equilibrium or (ii) one is the leader deciding first, the other responds optimally playing a Stackelberg game. The leader profits more than she does in (i). We present conditions under which the leader’s profit does not improve from (i) to (ii). © 2006 Elsevier B.V. All rights reserved.
متن کاملCompetitive Algorithms for Online Pricing
Given a seller with m amount of items, a sequence of users {u1, u2, ...} come one by one, the seller must set the unit price and assign some amount of items to each user on his/her arrival. Items can be sold fractionally. Each ui has his/her value function vi(·) such that vi(x) is the highest unit price ui is willing to pay for x items. The objective is to maximize the revenue by setting the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Computing Surveys
سال: 1998
ISSN: 0360-0300,1557-7341
DOI: 10.1145/274440.274442